Ultrafast optical property map generation using lookup tables

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterating Lookup Tables Efficiently

We show that every function f implemented as a lookup table can, by increasing the storage space by a small constant factor, be implemented such that the computational complexity of evaluating fm(x) is small independently of m and x.

متن کامل

Oblivious Lookup Tables

We consider the following question: given a group-homomorphic public-key encryption E, a ciphertext c = E(x, pk) hiding a value x using a key pk, and a ”suitable” description of a function f , can we evaluate E(f(x), pk) without decrypting c? We call this an oblivious lookup table and show the existence of such a primitive. To this end, we describe a concrete construction, discuss its security ...

متن کامل

Set Reconciliation and File Synchronization Using Invertible Bloom Lookup Tables

As more and more data migrate to the cloud, and the same files become accessible from multiple different machines, finding effective ways to ensure data consistency is becoming increasingly important. In this thesis, we cover current methods for efficiently maintaining sets of objects without the use of logs or other prior context, which is better known as the set reconciliation problem. We als...

متن کامل

Computing small discrete logarithms using optimized lookup tables

In our previous work Crux , we used an additively homomorphic elliptic-curve cryptosystem, based on El Gamal, to compute privacy-preserving statistics for the Tor network [4]. The decryption algorithm of our cryptographic scheme required the computation of a small discrete logarithm (DL). For small values, the computation of the DLP should have been trivial as an exhaustive search would quickly...

متن کامل

Enhancing the Symbolic Aggregate Approximation Method Using Updated Lookup Tables

Similarity search in time series data mining is a problem that has attracted increasing attention recently. The high dimensionality and large volume of time series databases make sequential scanning inefficient to tackle this problem. There are many representation techniques that aim at reducing the dimensionality of time series so that the search can be handled faster at a lower dimensional sp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Biomedical Optics

سال: 2016

ISSN: 1083-3668

DOI: 10.1117/1.jbo.21.11.110501